Lexical Navigation: Using Incremental Graph Drawing for Query Refinement

نویسندگان

  • Daniel Tunkelang
  • Roy J. Byrd
  • James W. Cooper
چکیده

Query refinement is a powerful tool for a document search and retrieval system. Lexical navigation—that is, the exploration of a network that expresses relations among all possible query terms—provides a natural mechanism for query refinement. An essential part of lexical navigation is the visualization of this network. This dynamic visualization problem is essentially one of incrementally drawing and manipulating a non-hierarchical graph. In this paper, we present the graph-drawing system we have developed for lexical navigation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Incremental Layout Method for Visualizing Online Dynamic Graphs

Graphs provide a visual means for examining relation data and forcedirected methods are often used to lay out graphs for viewing. Making sense of a dynamic graph as it evolves over time is challenging, and previous force-directed methods were designed for static graphs. In this paper, we present an incremental version of a multilevel multi-pole layout method with a refinement scheme incorporate...

متن کامل

A Knowledge-Based Multi-Agent Approach for Initial Query Refinement in Information Retrieval

Query refinement is one of the main approaches for overcoming natural language lexical ambiguity and improving the quality of search results in Information Retrieval. In this paper we propose a knowledge–rich personalized approach for iterative query reformulation before sending it to search engines and entropybased approach for refinement quality estimation. The underling hypothesis is that th...

متن کامل

Analysis of User query refinement behavior based on semantic features: user log analysis of Ganj database (IranDoc)

Background and Aim: Information systems cannot be well designed or developed without a clear understanding of needs of users, manner of their information seeking and evaluating. This research has been designed to analyze the Ganj (Iranian research institute of science and technology database) users’ query refinement behaviors via log analysis.    Methods: The method of this research is log anal...

متن کامل

Exploring Large RDF Datasets using a Faceted Search

We propose a facet-based RDF data exploration mechanism that lets the user visualize large RDF datasets by successively refining a query. The novel aspects of our work are: i) the SPARQL query pattern is visualized as a query graph, ii) the successive refinements are visualized in a query refinement graph, and iii) the result triples are visualized as a result RDF graph. The scheme is scalable ...

متن کامل

Guided Sketching for Visual Search and Exploration in Large Scatter Plot Spaces

Recently, there has been an interest in methods for filtering large scatter plot spaces for interesting patterns. However, user interaction remains crucial in starting an explorative analysis in a large scatter plot space. We introduce an approach for explorative search and navigation in large sets of scatter plot diagrams. By means of a sketch-based query interface, users can start the explora...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997